Optimization based job shop scheduling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Job Shop Scheduling and Heuristic Optimization

It is predicted that job shop type of manufacture will be used more than before due economical circumstances. Companies are forced to provide their customers with large variety of products in low volume production, with view of different requirements from product consumers and low stock levels. This article briefly reviews jobs shop scheduling techniques and present designing scheduling applica...

متن کامل

Constraint-Based Optimization and Approximation for Job-Shop Scheduling

We present constraint-based optimization algorithms and a constraintbased approximation algorithm for the job-shop scheduling problem. An empirical performance analysis shows that both the optimization algorithms and the approximation algorithm perform well. Especially the approximation algorithm is among the best algorithms known to date. We, furthermore, show that we can improve the performan...

متن کامل

Chapter 1 AN OPTIMIZATION - BASED ALGORITHM FOR JOB SHOP SCHEDULING

Scheduling is a key factor for manufacturing productivity. Effective scheduling can improve on-time delivery, reduce inventory, cut lead times, and improve the utilization of bottleneck resources. Because of the combinatorial nature of scheduling problems, it is often difficult to find optimal schedules, especially within a limited amount of computation time. Production schedules therefore are ...

متن کامل

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

Learning-based Scheduling in a Job Shop

A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no one rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 1993

ISSN: 0018-9286

DOI: 10.1109/9.277252